Almost all graphs with average degree 4 are 3-colorable
نویسندگان
چکیده
منابع مشابه
Almost All k-Colorable Graphs are Easy to Color
We describe a simple and eecient heuristic algorithm for the graph coloring problem and show that for all k 1, it nds an optimal coloring for almost all k-colorable graphs. We also show that an algorithm proposed by Br elaz and justiied on experimental grounds optimally colors almost all k-colorable graphs. EEcient implementations of both algorithms are given. The rst one runs in O(n+m log k) t...
متن کاملAlmost all graphs with 2.522 n edges are not 3-colorable
We prove that for c ≥ 2.522 a random graph with n vertices and m = cn edges is not 3-colorable with probability 1− o(1). Similar bounds for non-k-colorability are given for k > 3. 1991 Mathematics Subject Classification: Primary 05C80; Secondary 05C15.
متن کاملGraphs with maximum degree 6 are acyclically 11-colorable
An acyclic k-coloring of a graph G is a proper vertex coloring of G, which uses at most k colors, such that the graph induced by the union of every two color classes is a forest. In this note, we prove that every graph with maximum degree six is acyclically 11-colorable, thus improving the main result of [12].
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملTiling Tripartite Graphs with 3-Colorable Graphs
For any positive real number γ and any positive integer h, there is N0 such that the following holds. Let N > N0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + γ)N vertices in each of the other classes, then G can be tiled perfectly by copies of Kh,h,h. This extends the work in [Discrete Mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00120-x